A minimally altruistic refinement of Nash equilibrium

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A minimally altruistic refinement of Nash equilibrium

We introduce a minimal notion of altruism and use it to refine Nash equilibria in normal form games. We provide three independent existence proofs, relate minimally altruistic Nash equilibrium to other equilibrium concepts, conduct an in-depth sensitivity analysis, and provide examples where minimally altruistic Nash equilibrium leads to improved predictions. © 2013 Elsevier B.V. All rights res...

متن کامل

On the variational equilibrium as a refinement of the generalized Nash equilibrium

We are concerned with a class of Nash games in which the players’ strategy sets are coupled by a shared constraint. A widely employed solution concept for such games, referred to as generalized Nash games, is the generalized Nash equilibrium (GNE). The variational equilibrium (VE) [6] is a specific kind of GNE given by a solution of the variational inequality formed from the common constraint a...

متن کامل

Nash equilibrium

In game theory, Nash equilibrium (named after John Forbes Nash, who proposed it) is a solution concept of a game involving two or more players, in which each player is assumed to know the equilibrium strategies of the other players, and no player has anything to gain by changing only his own strategy unilaterally. If each player has chosen a strategy and no player can benefit by changing his or...

متن کامل

Refinements of Nash Equilibrium

In game theory, “refinement” refers to the selection of a subset of equilibria, typically on the grounds that the selected equilibria are more plausible than other equilibria. These notes are a brief, largely informal, survey of some of the most heavily used refinements. Throughout, “equilibria” means Nash equilibria (NE), unless I state otherwise explicitly. And throughout, I assume that the g...

متن کامل

Finding a simple Nash Equilibrium

Non-cooperative game theory has been tightly combined with Computational Methods, in which the Nash Equilibrium (NE) is undoubtedly the most important solution concept. While players face several Nash Equilibriums, their most pragmatic strategy may not be the most optimal one, but one they prefer for other reasons. Players may choose a sub-optimal strategy instead of a more optimal but more com...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Social Sciences

سال: 2013

ISSN: 0165-4896

DOI: 10.1016/j.mathsocsci.2013.10.003